Logarithmically small minors and topological minors
نویسندگان
چکیده
منابع مشابه
Logarithmically small minors and topological minors
For every integer t there is a smallest real number c(t) such that any graph with average degree at least c(t) must contain a Kt-minor (proved by Mader). Improving on results of Shapira and Sudakov, we prove the conjecture of Fiorini, Joret, Theis and Wood that any graph with n vertices and average degree at least c(t) + ε must contain a Kt-minor consisting of at most C(ε, t) logn vertices. Mad...
متن کاملPacking Topological Minors Half-Integrally
A family F of graphs has the Erdős-Pósa property if for every graph G, the maximum number of pairwise disjoint subgraphs isomorphic to members of F contained in G and the minimum size of a set of vertices of G hitting all such subgraphs are bounded by functions of each other. Robertson and Seymour proved that if F consists of H-minors for some fixed graph H, then the planarity of H is equivalen...
متن کاملCompact topological minors in graphs
Let be a real number such that 0< <2 and t a positive integer. Let n be a sufficiently large positive integer as a function of t and . We show that every n-vertex graph with at least n1+ edges contains a subdivision of Kt in which each edge of Kt is subdivided less than 10/ times. This refines the main result in [A. Kostochka and Pyber, Combinatorica 8 (1988), 83–86] and resolves an open questi...
متن کاملDominating functions and topological graph minors
An infinite graph G is called dominating if its vertices can be labelled with natural numbers in such a way that for every function f : ω→ ω there is a ray in G whose sequence of labels eventually exceeds f . Conversely, G is called bounded if for every labelling of its vertices with natural numbers there exists a function f : ω→ω which eventually exceeds the labelling along any ray in G. This ...
متن کاملOn Topological Minors in Random Simplicial Complexes
Simplicial Complexes. A (finite abstract) simplicial complex is a finite set system that is closed under taking subsets, i.e., F ⊂ H ∈ X implies F ∈ X. The sets F ∈ X are called faces of X. The dimension of a face F is dim(F ) = |F | − 1. The dimension of X is the maximal dimension of any face. A k-dimensional simplicial complex will also be called a k-complex.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the London Mathematical Society
سال: 2014
ISSN: 0024-6107
DOI: 10.1112/jlms/jdu063